منابع مشابه
Colored Saturation Parameters for Rainbow Subgraphs
Inspired by a 1987 result of Hanson and Toft [Edge-colored saturated graphs, J. Graph Theory 11 (1987), 191–196] and several recent results, we consider the following saturation problem for edge-colored graphs. An edge-coloring of a graph F is rainbow if every edge of F receives a different color. Let R(F ) denote the set of rainbow-colored copies of F . A t-edge-colored graph G is (R(F ), t)-s...
متن کاملGraph Saturation Games
We study F-saturation games, first introduced by Füredi, Reimer and Seress [1] in 1991, and named as such by West [2]. A graph G is H-saturated if H is not a subgraph of G, but adding any edge to G causes H to be a subgraph. We can ask what the minimum or maximum number of edges in an H-saturated graph on n vertices is they are known as the saturation number and Turán number (extremal number), ...
متن کاملMulticomponent Adsorption and Chromatography with Uneven Saturation Capacities
In chromatographic separations involving elutes with large differences in the molecular size, the adsorption saturation capacities of the elutes may differ because of the differences in the degree of size exclusion. With uneven saturation capacities, isotherm crossovers may occur, which often results in selectivity reversal. In this work, a new multicomponent isotherm has been developed for thi...
متن کاملRainbow Connection Number of Graph Power and Graph Products
The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. This graph parameter was introduced by Chartrand et al. in 2008. The problem has garnered considerable interest and several variants of the initial version have since been intr...
متن کاملRainbow Connection Number of Graph Power and Graph Products
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (Note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely cartesian p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1155429